Minimum convex-cost tension problems on series-parallel graphs
نویسندگان
چکیده
منابع مشابه
Minimum convex-cost tension problems on series-parallel graphs
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost t...
متن کاملMinimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs
This article proposes an extension, combined with the out-of-kilter technique, of the aggregation method (that solves the minimum convex piecewise linear cost tension problem, or CPLCT, on series-parallel graphs) to solve CPLCT on quasi series-parallel graphs. To make this algorithm efficient, the key point is to find a "good" way of decomposing the graph into series-parallel subgraphs. Decompo...
متن کاملCombinatorial problems on series-parallel graphs
We show, in a unified manner, that there exist linear time algorithms for many combinatorial problems defined on the class of series-parallel graphs. These include (i) the decision problem, and (ii) the minimum edge (vertex) deletion problem both with respect to a property characterized by a finite number of forbidden graphs, and (iii) the generalized matching problem.
متن کاملMinimum Linear Arrangement of Series-Parallel Graphs
We present a factor 14D approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(|E|) and is very easy to implement. Its divide-andconquer approach allows for an effective parallelization. Note that a suitable decomposition can also be comput...
متن کاملOn Maximum Common Subgraph Problems in Series-Parallel Graphs
The complexity of the maximum common connected subgraph problem in partial k-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial 2-trees. On the contrary, the problem is known to be NP-hard in vertex-labeled partial 11-trees of bounded degree. We consider series-parallel graphs, i.e., partial 2-trees. We show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2003
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2004202